Algorithms for finding K-best perfect matchings
نویسندگان
چکیده
منابع مشابه
Finding Perfect Matchings in Bipartite Hypergraphs
Haxell’s condition [Hax95] is a natural hypergraph analog of Hall’s condition, which is a wellknown necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell’s condition holds it forces the existence of a perfect matching in the bipartite hypergraph. Unlike in graphs, however, there is no known polynomial time algorithm to find the hypergraph per...
متن کاملPerfect Fractional Matchings in $k$-Out Hypergraphs
Extending the notion of (random) k-out graphs, we consider when the k-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each r there is a k = k(r) such that the k-out r-uniform hypergraph on n vertices has a perfect fractional matching with high probability (i.e., with probability tending to 1 as n → ∞) and prove an analogous result for r-uniform r-...
متن کاملFinding Best k Policies
An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k best policies problem. The problem is to find the k best policies. The k best policies, k > 1, cannot be found directly using dynamic programming. Näıvely, finding the k-th best policy can be Turing reduced to the optimal planni...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملParallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings
Let k be a positive integer, a subset Q of the set of vertices of a graph G is k-dependent in G if each vertex of Q has no more than k neighbours in Q. We present a parallel algorithm which computes a maximal k-dependent set in a graph on n nodes in time O(log 4 n) on an EREW PRAM with O(n 2) processors. In this way, we establish the membership of the problem of constructing a maximal k-depende...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90017-5